Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
نویسندگان
چکیده
منابع مشابه
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming
A new finite blocklength converse for the SlepianWolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength pointto-point coding problems from [3] is employed. However, a direct application of this framework dem...
متن کاملIndex coding via linear programming
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. Optimal encoding schemes and efficient heuristics were studied in various settings, alongside leading to new results for Network Coding such as improved gaps between linear and n...
متن کاملLinear index coding via semidefinite programming
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is k...
متن کاملImproved consensus clustering via linear programming
We consider the problem of Consensus Clustering. Given a finite set of input clusterings over some data items, a consensus clustering is a partitioning of the items which matches as closely as possible the given input clusterings. The best exact approach to tackling this problem is by modelling it as a Boolean Integer Program (BIP). Unfortunately, the size of the BIP grows cubically in the numb...
متن کاملRandom Access Channel Coding in the Finite Blocklength Regime
The paper considers a random multiple access channel communication scenario with an unknown number of transmitters. The collection of active transmitters remains fixed during each epoch, but neither the transmitters nor the receiver know which subset of transmitters that is nor even the number of active transmitters. The receiver discerns from the channel output both the number of active transm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2873623